Achievable Secrecy Rate Regions of State Dependent Causal Cognitive Interference Channel
Authors
Abstract:
In this paper, the secrecy problem in the state dependent causal cognitive interference channel is studied. The channel state is non-causally known at the cognitive encoder. The message of the cognitive encoder must be kept secret from the primary receiver. We use a coding scheme which is a combination of compress-and-forward strategy with Marton coding, Gel’fand-Pinsker coding and Wyner’s wiretap coding at the cognitive encoder. We use rate splitting for messages at both transmitters. Furthermore, the cognitive user compresses its channel observation using Wyner-Ziv coding and splits the index of its compressed signal. By using this scheme we derive an achievable secrecy rate region for this channel and extend the results to the Gaussian case and provide some numerical results.
similar resources
On The Secrecy of the Cognitive Interference Channel with Channel State
In this paper the secrecy problem in the cognitive state-dependent interference channel is considered. In this scenario we have a primary and a cognitive transmitter-receiver pairs. The cognitive transmitter has the message of the primary sender as side information. In addition, the state of the channel is known at the cognitive encoder. Hence, the cognitive encoder uses this side information t...
full textOn the Achievable Rate-Regions for State-Dependent Gaussian Interference Channel
In this paper, we study a general additive state-dependent Gaussian interference channel (ASD-GIC) where we consider two-user interference channel with two independent states known non-causally at both transmitters, but unknown to either of the receivers. An special case, where the additive states over the two links are the same is studied in [1], [2], in which it is shown that the gap between ...
full textOn The Secrecy of the Cognitive Interference Channel with Channel State
In this paper the secrecy problem in the cognitive statedependent interference channel is considered. In this scenario we have a primary and a cognitive transmitter-receiver pairs. The cognitive transmitter has the message of the primary sender as side information. In addition, the state of the channel is known at the cognitive encoder. So, the cognitive encoder uses this side information to co...
full textA Comparison of Two Achievable Rate Regions for the Interference Channel
A recent result for the general interference channel is presented. The encoding technique is a generalization of the technique employed by Han and Kobayashi. Coupled with an improvement in the computation of the error probabilities, fewer constraints are necessary to define the achievable rate region. We further compare the two achievable rate regions and discuss whether the two achievable rate...
full textCodewords With Memory Improve Achievable Rate Regions of the Memoryless Gaussian Interference Channel
The two-user Gaussian interference channel (GIC) has been extensively studied in the literature during the last four decades. The full characterization of the capacity region of the GIC is a longstanding open problem, except the case of strong or very strong interference. For general GIC’s, many inner bounds have been provided over the years, among of them, the Han-Kobayashi (HK) region, is the...
full textOn the capacity of state-dependent Gaussian cognitive interference channel
A Gaussian cognitive interference channel with state (G-CICS) is studied. In this paper, we focus on the two-sender, two-receiver case and consider the communication situation in which two senders transmit a common message to two receivers. Transmitter 1 knows only messageW1, and transmitter 2, referred to as the cognitive user, knows both messagesW1 andW2 and also the channel’s states sequence...
full textMy Resources
Journal title
volume 7 issue 1
pages 102- 117
publication date 2018-06-01
By following a journal you will be notified via email when a new issue of this journal is published.
Hosted on Doprax cloud platform doprax.com
copyright © 2015-2023